On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Contention-free interleavers have been recently shown to be suitable for parallel decoding of turbo codes. In this correspondence, it is shown that permutation polynomials generate maximum contention-free interleavers, i.e., every factor of the interleaver length becomes a possible degree of parallel processing of the decoder. Further, it is shown by computer simulations that turbo codes using these interleavers perform very well for the 3rd Generation Partnership Project (3GPP) standard.Comment: 13 pages, 2 figures, submitted as a correspondence to the IEEE Transactions on Information Theory, revised versio

On Quadratic Inverses for Quadratic Permutation Polynomials over Integer Rings

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Sun and Takeshita have recently shown that the class of quadratic permutation polynomials over integer rings provides excellent performance for turbo codes. In this correspondence, a necessary and sufficient condition is proven for the existence of a quadratic inverse polynomial for a quadratic permutation polynomial over an integer ring. Further, a simple construction is given for the quadratic inverse. All but one of the quadratic interleavers proposed earlier by Sun and Takeshita are found to admit a quadratic inverse, although none were explicitly designed to do so. An explanation is argued for the observation that restriction to a quadratic inverse polynomial does not narrow the pool of good quadratic interleavers for turbo codes.Comment: Submitted as a Correspondence to the IEEE Transactions on Information Theory Submitted : April 1, 2005 Revised : Nov. 15, 200

Stochastic Resolution of Identity for Real-Time Second-Order Green's Function: Ionization Potential and Quasi-Particle Spectrum.

We develop a stochastic resolution of identity approach to the real-time second-order Green's function (real-time sRI-GF2) theory, extending our recent work for imaginary-time Matsubara Green's function [ Takeshita et al. J. Chem. Phys. 2019 , 151 , 044114 ]. The approach provides a framework to obtain the quasi-particle spectra across a wide range of frequencies and predicts ionization potentials and electron affinities. To assess the accuracy of the real-time sRI-GF2, we study a series of molecules and compare our results to experiments as well as to a many-body perturbation approach based on the GW approximation, where we find that the real-time sRI-GF2 is as accurate as self-consistent GW. The stochastic formulation reduces the formal computatinal scaling from O(Ne5) down to O(Ne3) where Ne is the number of electrons. This is illustrated for a chain of hydrogen dimers, where we observe a slightly lower than cubic scaling for systems containing up to Ne ≈ 1000 electrons

Analysis of cubic permutation polynomials for turbo codes

Quadratic permutation polynomials (QPPs) have been widely studied and used as interleavers in turbo codes. However, less attention has been given to cubic permutation polynomials (CPPs). This paper proves a theorem which states sufficient and necessary conditions for a cubic permutation polynomial to be a null permutation polynomial. The result is used to reduce the search complexity of CPP interleavers for short lengths (multiples of 8, between 40 and 352), by improving the distance spectrum over the set of polynomials with the largest spreading factor. The comparison with QPP interleavers is made in terms of search complexity and upper bounds of the bit error rate (BER) and frame error rate (FER) for AWGN and for independent fading Rayleigh channels. Cubic permutation polynomials leading to better performance than quadratic permutation polynomials are found for some lengths.Comment: accepted for publication to Wireless Personal Communications (19 pages, 4 figures, 5 tables). The final publication is available at springerlink.co

The Sodium Channel B4-Subunits are Dysregulated in Temporal Lobe Epilepsy Drug-Resistant Patients

Temporal lobe epilepsy (TLE) is the most common type of partial epilepsy referred for surgery due to antiepileptic drug (AED) resistance. A common molecular target for many of these drugs is the voltage-gated sodium channel (VGSC). The VGSC consists of four domains of pore-forming α-subunits and two auxiliary β-subunits, several of which have been well studied in epileptic conditions. However, despite the β4-subunits’ role having been reported in some neurological conditions, there is little research investigating its potential significance in epilepsy. Therefore, the purpose of this work was to assess the role of SCN4β in epilepsy by using a combination of molecular and bioinformatics approaches. We first demonstrated that there was a reduction in the relative expression of SCN4B in the drug-resistant TLE patients compared to non-epileptic control specimens, both at the mRNA and protein levels. By analyzing a co-expression network in the neighborhood of SCN4B we then discovered a linkage between the expression of this gene and K+ channels activated by Ca2+, or K+ two-pore domain channels. Our approach also inferred several potential effector functions linked to variation in the expression of SCN4B. These observations support the hypothesis that SCN4B is a key factor in AED-resistant TLE, which could help direct both the drug selection of TLE treatments and the development of future AED